ar X iv : 1 21 0 . 56 59 v 1 [ cs . L O ] 2 0 O ct 2 01 2 Weighted Modal Transition Systems ⋆
نویسندگان
چکیده
Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore fragile in the sense that the inevitable approximation of systems by models, combined with the fundamental unpredictability of hardware platforms, makes it difficult to transfer conclusions about the behavior, based on models, to the actual system. Hence this approach is arguably unsuited for modern software systems. We propose here the first specification theory which allows to capture quantitative aspects during the refinement and implementation process, thus leveraging the problems of the qualitative setting. Our proposed quantitative specification framework uses weighted modal transition systems as a formal model of specifications. These are labeled transition systems with the additional feature that they can model optional behavior which may or may not be implemented by the system. Satisfaction and refinement is lifted from the well-known qualitative to our quantitative setting, by introducing a notion of distances between weighted modal transition systems. We show that quantitative versions of parallel composition as well as quotient (the dual to parallel composition) inherit the properties from the Boolean setting.
منابع مشابه
ar X iv : h ep - l at / 0 01 00 56 v 1 2 8 O ct 2 00 0 1 Perturbative renormalization of the ∆ B = 2 four - quark operators in lattice
We present a perturbative calculation of the renormalization constants for the ∆B = 2 four-quark operators, which is needed to evaluate the bag parameters BB and BS in lattice QCD. The one-loop coefficients are calculated for the O(1/M) NRQCD heavy quark action and the O(a)-improved Wilson action for light quark. Using these coefficients, which remove O(αs/aM) error, we reanalyze our previous c...
متن کاملar X iv : 1 71 0 . 05 14 0 v 1 [ cs . C C ] 1 4 O ct 2 01 7 On complexity of multidistance graph recognition in R 1 Mikhail Tikhomirov
Let A be a set of positive numbers. A graph G is called an Aembeddable graph in R if the vertices of G can be positioned in R so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.
متن کاملar X iv : h ep - l at / 0 11 01 30 v 1 1 6 O ct 2 00 1 1 QCD spectroscopy with three light quarks
We report about a simulation using three dynamical Wilson quarks and on the progress in going to small quark masses.
متن کاملar X iv : 0 81 0 . 50 56 v 1 [ cs . C C ] 2 8 O ct 2 00 8 P is not equal to NP . Sten - Åke
SAT 6∈ P is true, and provable in a simply consistent extension B of a first order theory B of computing, with a single finite axiom B characterizing a universal Turing machine. Therefore P 6 = NP is true, and provable in a simply consistent extension B of B.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012